The Global Power of Additional Queries to Random Oracles
نویسندگان
چکیده
It is shown that, for every k>0 and every fixed algorithmically random language B, there is a language that is polynomial-time, truth-table reducible in k+1 queries to B but not truth-table reducible in k queries in *any* amount of time to *any* algorithmically random language C. In aprticular, this yields the separation P (RAND) is a proper subset of P (RAND), k-tt (k+1)-tt where RAND is the set of all algorithmically random languages. Disciplines Theory and Algorithms This article is available at Iowa State University Digital Repository: http://lib.dr.iastate.edu/cs_techreports/110 The Global Power of Additional Queries to Random Oracles TR 92-37 Jack H. Lutz and David M. Martin Jr.
منابع مشابه
The Global Power of Additional Queries to p-Random Oracles
We consider separations of reducibilities by random sets. First, we show a result on polynomial time-bounded reducibilities that query their oracle nonadaptively: for every p-random set R, there is a set that is reducible to R with k + 1 queries but is not reducible to any other p-random set with at most k queries. This result solves an open problem stated in a recent survey paper by Lutz and M...
متن کاملActive Learning with Oracle Epiphany
We present a theoretical analysis of active learning with more realistic interactions with human oracles. Previous empirical studies have shown oracles abstaining on difficult queries until accumulating enough information to make label decisions. We formalize this phenomenon with an “oracle epiphany model” and analyze active learning query complexity under such oracles for both the realizable a...
متن کاملForschungsberichte Mathematische Logik Learning via Queries and Oracles Universitt at Heidelberg Mathematisches Institut Learning via Queries and Oracles
Inductive inference considers two types of queries: Queries to a teacher about the function to be learned and queries to a non-recursive oracle. This paper combines these two types | it considers three basic models of queries to a teacher (QEXXSucc], QEXX<] and QEX+]) together with membership queries to some oracle. The results for each of these three models of query-inference are the same: If ...
متن کاملSolving Marginal MAP Problems with NP Oracles and Parity Constraints
Arising from many applications at the intersection of decision making and machine learning, Marginal Maximum A Posteriori (Marginal MAP) Problems unify the two main classes of inference, namely maximization (optimization) and marginal inference (counting), and are believed to have higher complexity than both of them. We propose XOR_MMAP, a novel approach to solve the Marginal MAP Problem, which...
متن کامل1 Commutative Queries
7 We consider polynomial-time Turing machines that have access to two oracles and investigate when the order of oracle queries is significant. The oracles used here are complete languages for the Polynomial Hierarchy (PH). We prove that, for solving decision problems, the order of oracle queries does not matter. This improves upon the previous result of Hemaspaandra, Hemaspaandra and Hempel, wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 120 شماره
صفحات -
تاریخ انتشار 1994